Random sequence generation by cellular automata

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Sequence Generation by Cellular Automata

A J -dimensional cellular automaton which generates random sequences is discussed. Each site in the cellular automaton has value 0 or J, and is updated in parallel according to the rule a; = ai_1 XOR (ai OR ai+l ) (a; = (ai_1 +ai +ai+1 +aiai+l ) mod 2). Despite the simplicity of this rule, the time sequences of site values that it yields seem to be completely random. These sequences are analyse...

متن کامل

Analysis of Pseudo Random Sequence Generated by Cellular Automata

The security of cellular automata for stream cipher applications is investigated. A cryptanalytic algorithm is developed for a known plaintext attack where the plaintext is assumed to be known up to the unicity distance. The algorithm is shown to be successful on small computers for key sizes up to N between 300 and 500 bits. For a cellular automaton to be secure against more powerful adversari...

متن کامل

Pseudo-random Sequences Generated by Cellular Automata

Generation of pseudo random sequences by cellular automata, as well as by hybrid cellular automata is surveyed. An application to the fast evaluation and FPGA implementation of some classes of boolean functions is sketched out.

متن کامل

Elementary Cellular Automata with Minimal Memory and Random Number Generation

Cellular automata (CA) are discrete, spatially explicit extended dynamic systems. CA systems are composed of adjacent cells or sites arranged as a regular lattice, which evolve in discrete time steps. Each cell is characterized by an internal state whose value belongs to a finite set. The updating of these states is made simultaneously according to a common local transition rule involving a nei...

متن کامل

Incremental Evolution of Cellular Automata for Random Number Generation

Incremental Evolution of Cellular Automata for Random Number Generation Sheng-Uei Guan and Shu Zhang Department of Electrical & Computer Engineering National University of Singapore 10 Kent Ridge Crescents, Singapore 119260 {eleguans, engp9594}@nus.edu.sg Abstract Cellular automata (CA) have been used in pseudorandom number generation for over a decade. Recent studies show that controllable CA ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 1986

ISSN: 0196-8858

DOI: 10.1016/0196-8858(86)90028-x